Scalable Content-based Publish/Subscribe
نویسندگان
چکیده
Despite suffering from inefficiency and flexibility limitations, the filter-based routing (FBR) algorithm is widely used in content-based publish/subscribe (pub/sub) systems. To address these limitations, we propose a dynamic destination-based routing algorithm called D-DBR, which decomposes pub/sub into two independent parts: Content-based matching and destinationbased multicasting. D-DBR exhibits low event matching cost and high efficiency, flexibility, and robustness for event routing for overlays with up to hundreds of brokers. We further extend DDBR to a novel routing algorithm called MERC for overlays with larger number of brokers. MERC divides the overlay into interconnected clusters and applies FBR and D-DBR to route events interand intra-cluster, respectively. We implemented all algorithms in the PADRES pub/sub system. Experimental results show that our algorithms outperform FBR in terms of improving event dissemination throughput by up to 700% and reducing the end-to-end latency by up to 55%.
منابع مشابه
Efficient Filtering and Routing in a Scalable XML-Based Publish-Subscribe System
This paper introduces YAK – a scalable contentbased publish-subscribe system. YAK employs XML documents and expressive XPath queries as the publication and subscription model. To achieve high scalability, it combines the advantages of content routing in existing publish-subscribe systems and the efficient query indexing technique in the context of XML filtering. The filtering and routing strate...
متن کاملSub-2-Sub: Self-Organizing Content-Based Publish Subscribe for Dynamic Large Scale Collaborative Networks
In this paper, we address the problem of constructing scalable content-based publish/subscribe systems. Publish/subscribe systems are asynchronous event-notification systems in which a published event is forwarded to exactly those nodes that have previously subscribed for that event. Subscriptions can range from a simple specification of merely the type of an event to a specification of the val...
متن کاملContent-based Publish-Subscribe Over Structured P2P Networks
In this work we leverage the advantages of the Chord DHT to build a content-based publish-subscribe system that is scalable, self-organizing, and well-performing. However, DHTs provide very good support only for exact-match, equality predicates and range predicates are expected to be very popular when specifying subscriptions in pub/sub systems We will thus also provide solutions supporting eff...
متن کاملEpidemic Algorithms for Reliable Content-Based Publish-Subscribe
Distributed content-based publish-subscribe middleware provides the necessary decoupling, flexibility, expressiveness, and scalability required by modern distributed applications. Unfortunately, this kind of middleware usually does not provide reliability guarantees, as this problem has been thus far largely disregarded by the research community and solutions developed in other contexts are not...
متن کاملAn efficient and scalable framework for content-based publish/subscribe systems
Challenges for content-based publish/subscribe systems include efficient subscription management and event matching, load balancing, and efficient and scalable event delivery. This paper presents an efficient and scalable framework for content-based publish/subscribe systems. We propose using K-D trees to dynamically partition and organize subscriptions, thereby preserving subscription locality...
متن کاملMeghdoot: Content-Based Publish/Subscribe over P2P Networks
Publish/Subscribe systems have become a prevalent model for delivering data from producers (publishers) to consumers (subscribers) distributed across wide-area networks while decoupling the publishers and the subscribers from each other. In this paper we present Meghdoot, which adapts content-based publish/subscribe systems to Distributed Hash Table based P2P networks in order to provide scalab...
متن کامل